Extended Diffie-Hellman Technique to Generate Multiple Shared Keys at a Time with Reduced KEOs and its Polynomial Time Complexity
نویسنده
چکیده
Recently Biswas[1] extended Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of two public keys. In this paper, we further generalize the Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of any number of public keys and study its Polynomial Time Complexity, Security etc. Also, an upper bound for the number of shared keys in terms of the number of exchanged keys and for a given number of shared keys, the minimum required number of keys to be exchanged, were arrived at. Lastly, a comparative study between the proposed technique and the Diffie-Hellman technique repeated m-times is made.
منابع مشابه
Diffie-Hellman technique: extended to multiple two-party keys and one multi-party key
Diffie –Hellman technique: extended to multiple two-party keys and one multi-party key Abstract: The two-party Diffie– Hellman (DH) key-exchanging technique is extended to generate (i) multiple two-party keys and (ii) one multi-party key. The participants in the former case exchange two public keys and generate 15 shared keys. Of these, 4 keys are called base keys, because they are used to gene...
متن کاملWeak keys of the Diffie Hellman key exchange II : Pairing based schemes on elliptic curves
This paper develops a cryptanalysis of the pairing based Diffie Hellman (DH) key exchange schemes which have found important applications as in the tripartite exchange scheme proposed in [1]. The analysis of weak keys of the standard DH scheme proposed in [2] is applied to show existence of weak sessions for tripartite schemes over supersingular curves. It is shown that for such sessions the as...
متن کاملCircular-Secure Encryption Beyond Affine Functions
We show that for any constant d ∈ N, there exists a public-key encryption scheme that can securely encrypt any function f of its own secret-key, assuming f can be expressed as a polynomial of total degree-d. Such a scheme is said to be key-dependent message (KDM) secure w.r.t. degree-d polynomials. We also show that there exists a public-key encryption scheme that is KDM secure w.r.t. all Turin...
متن کاملPost-Quantum Cryptography: S381 Cyclic Subgroup of High Order
—Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor's polynomial time algorithm for numerical field problems like integer factorization (IFP) or the discrete logarithm (DLP). The use of non-commutative or non-associative structures are, among others, valid choices for th...
متن کاملA new cryptosystem based on elliptic curves and polynomial matrices*
The system we propose is a mathematical problem with the necessary properties to define public key cryptosystems. It is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) and polynomial matrices. In this way, we achieve to increase the possible number of keys and, therefore, we augment the resolution complexity of the system. Also, we make a cryptanalisys of the system detecting its...
متن کامل